Global Optimization by Adiabatic Switching

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global Optimization by Adiabatic Switching

We apply a recently introduced method for global optimization to determine the ground state energy and configuration for model metallic clusters. The global minimum for a given N–atom cluster is found by following the damped dynamics of the N particle system on an evolving potential energy surface. In this application, the time dependent interatomic potential interpolates adiabatically between ...

متن کامل

Some Aspects on Adiabatic Switching

In adiabatic switching 2] up to now the major focus has been on proving the usefulness of this kind of circuit technology by constructing various kinds of digital systems in full custom design. This is, however, not a desirable way to treat more complex systems. Therefore, it is necessary to provide some systematic design procedure that can be automized and is capable to handle all kinds of log...

متن کامل

Non-hermitian Adiabatic Quantum Optimization

Many physical and combinatorial problems associated with complex networks of interacting degrees of freedom can be mapped to equivalent problems of finding the ground (or minimum cost) state of a corresponding quantum Hamiltonian H0 1,2,3,4,5,6,7,8,9. One of the approaches to finding the ground state of H0 is adiabatic quantum computation which can be formulated as follows. Consider the time de...

متن کامل

Adiabatic optimization without local minima

Several previous works have investigated the circumstances under which quantum adiabatic optimization algorithms can tunnel out of local energy minima that trap simulated annealing or other classical local search algorithms. Here we investigate the even more basic question of whether adiabatic optimization algorithms always succeed in polynomial time for trivial optimization problems in which t...

متن کامل

Global optimization by continuous grasp

We introduce a novel global optimizationmethod calledContinuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the domain of discrete optimization to that of continuous global optimization. This stochastic local search method is simple to implement, is widely applicable, and does not make use of derivative information, thus making it a w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Molecular Sciences

سال: 2002

ISSN: 1422-0067

DOI: 10.3390/i3010030